Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
321	On differentially private low rank approximation Michael Kapralov∗ Kunal Talwar† October 3, 2012 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Matrix theory Abstract algebra Numerical linear algebra Differential calculus Vector space Eigenvalues and eigenvectors Exponential mechanism Singular value decomposition Rayleigh quotient Algebra Mathematics Linear algebra
322	Instantons in Quantum Chromodynamics Periodicity of the Yang–Mills potential energy Let us temporarily work in the Aa0 = 0 gauge, called Weyl or Hamiltonian gauge, and forget about fermions (=quarks) for a while. The r Add to Reading List Source URL: thd.pnpi.spb.ru Language: English - Date: 2008-12-19 09:59:46 Quantum chromodynamics Theoretical physics Differential geometry Instanton Gauge theories Chern–Simons theory WKB approximation Yang–Mills theory Physics Quantum field theory Particle physics
323	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
324	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
325	A theory of occlusion in the context of optical ow Steven S. Beauchemin and John L. Barron 1 Introduction Traditionally, image motion and its approximation known as optical ow have Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2010-12-14 19:48:17 Integral transforms Mathematics Joseph Fourier Unitary operators Fourier transform Mathematical analysis Fourier analysis Digital signal processing
326	Knowledge Compilation and Theory Approximation Henry Kautz and Bart Selman Presented by Kelvin Ku Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2006-03-10 18:11:39 Structure Universal algebra Horn clause Logic Mathematical logic Mathematics Model theory
327	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
328	Advanced Algorithms – COMS31900Lecture 16 Approximation Algorithms (part one) P, NP and constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Applied mathematics NP-complete NP-hard P versus NP problem NP Polynomial-time reduction P Complete Reduction Theoretical computer science Computational complexity theory Complexity classes
329	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics
330	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics

UPDATE